On Local Optima Distribution in Buffer Allocation Problem for Production Line with Unreliable Machines

In this paper, we consider a buffer allocation problem in manufacturing flow lines with series-parallel network structure where nodes correspond to buffers of finite capacity, and arcs the machines. The machines are supposed be unreliable, their time failure repair assumed exponentially distributed. Different may have different production rates all deterministic. is determine capacities respect given optimality criterion, which function average rate line, acquisition installation cost inventory cost. search for optimum, tentative solutions evaluated by means an approximate method based on Markov models aggregation. We carry out computational experiments local genetic algorithms. It turns that “massif central” or “big valley” fitness landscape present but only partially: optima negatively correlated distance best found solution, yet set can not encompassed ball relatively small radius. Moreover, show many instances, several clusters identified. symmetries discussed suggested as possible cause clustering. Finally performance algorithms bfiefly